The Shortest Route
نویسنده
چکیده
منابع مشابه
Modeling different decision strategies in a time tabled multimodal route planning by integrating the quantifier-guided OWA operators, fuzzy AHP weighting method and TOPSIS
The purpose of Multi-modal Multi-criteria Personalized Route Planning (MMPRP) is to provide an optimal route between an origin-destination pair by considering weights of effective criteria in a way this route can be a combination of public and private modes of transportation. In this paper, the fuzzy analytical hierarchy process (fuzzy AHP) and the quantifier-guided ordered weighted averaging (...
متن کاملRoute Adaptation and Persistence in Networks
This dissertation studies the trade-off between route adaptation and persistence. OUf thesis is that adding route persistence to shortest-path routing can enhance network performance, especially under heavy traffic conditions. Shortest-path routing can cause route oscillation and instability, thereby increasing congestion and reducing the effective throughput of the network. To study the effect...
متن کاملApplication of A Route Expansion Algorithm for Transit Routes Design in Grid Networks
Establishing a network of transit routes with satisfactory demand coverage is one of the main goals of transitagencies in moving towards a sustainable urban development. A primary concern in obtaining such anetwork is reducing operational costs. This paper deals with the problem of minimizing construction costsin a grid transportation network while satisfying a certain level o...
متن کاملOn The Watchman Route Problem and Its Related Problems
We propose to study the watchman route problem and its related problems. The watchman route problem asks a shortest closed path within a given polygon so that every point in the polygon is visible from at least one point on the path. We first discuss the watchman route problem for simple polygons, for polygonal domains, and for arrangements of lines and line segments. We then focus on a problem...
متن کاملConcerning the Time Bounds of Existing Shortest Watchman Route Algorithms
A watchman route in a polygon P is a route inside P such that each point in the interior of P is visible from at least one point along the route. The objective of the shortest watchman route problem is to minimize the length of the watchman route for a given polygon. In 1991 Chin and Ntafos claimed an O(n 4) algorithm, solving the shortest watchman route problem for simple polygons, given a sta...
متن کاملWatchman routes in the presence of a pair of convex polygons
Given a set of polygonal obstacles in the plane, the shortest watchman route problem asks for a closed route from which each point in the exterior of the polygons is visible to some point along the route. This problem is known to be NP-hard and the development of an eecient approximation algorithm is still open. We present an O(n 2) time algorithm for computing the shortest watchman route for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009